Tchebychev acceleration technique for large scale nonsymmetric matrices

Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.     

Application of tris-allyl-DOTA in the preparation of DOTA-peptide conjugates

The synthesis of tris-allyl-DOTA starting from cyclen and its application in the preparation of DOTA-peptide conjugates is reported. Clinically important conjugates such as DOTA-Tyr³-octreotide (DOTA-TOC), DOTA-Tyr³-octreotate (DOTA-TATE) as well as a DOTA-RGD peptide were synthesized in high yields with Fmoc solid phase peptide synthesis. The final, extremely reliable de-allylation was achieved on solid phase by different methods identifying morpholine/Pd(0) as the most suitable one obtaining all DOTA peptide conjugates in high yields. All DOTA-peptides were purified by reversed phase HPLC and structural identity was proved using MALDI-TOF mass spectrometry.     

Semi-synthesis of secologanin analogues

Secologanin, a complex iridoid terpene natural product, was derivatized at the vinyl and ester functional groups using cross-metathesis and transesterification methodology, respectively.     

The Recognition of Double Euler Trails in Series-Parallel Networks

Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese₁, e₂,…,e_kis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network.     

Preconcentration of trace antimony in tap and sea water on activated alumina. Determination by graphite furnace atomic absorption spectrometry

Summary A method is described for antimony preconcentration based on retention on a column of activated alumina. Recovery is 80% when no pH-control and 4 mol/l HCl as eluent are used. The preconcentration factor is 400. The method was applied to the determination of antimony in spiked tap and sea water. The analytical performance of the method is discussed.     

Sustainability in bankruptcy problems

This paper focuses on a new property for bankruptcy rules, calledsustainability, which requires that the agents with small enough claims be fully reimbursed. We show that the constrained equal-awards rule is the only rule that satisfies path independence and sustainability. Exploiting duality relations, we also provide a characterization of the constrained equal-losses rule, as the only one that satisfies composition and independence of residual claims (the dual property of sustainability).     

Synchronization Analysis of Coupled Noncoherent Oscillators

We present two different approaches to detect and quantify phase synchronization in the case of coupled non-phase coherent oscillators. The first one is based on the general idea of curvature of an arbitrary curve. The second one is based on recurrences of the trajectory in phase space. We illustrate both methods in the paradigmatic example of the R?ssler system in the funnel regime. We show that the second method is applicable even in the case of noisy data. Furthermore, we extend the second approach to the application of chains of coupled systems, which allows us to detect easily clusters of synchronized oscillators. In order to illustrate the applicability of this approach, we show the results of the algorithm applied to experimental data from a population of 64 electrochemical oscillators.     

Chelate polymers: II. Some novel transition metals complexes with azomethine‐containing siloxanes and their polyesters

New Schiff bases of 2,4‐dihydroxybenzaldehyde with siloxane‐α,ω‐diamines having different numbers of siloxane units in the chain have been synthesized and characterized by spectroscopy, elemental and thermal analyses. These azomethines were found to form complexes readily with copper(II), nickel(II), cobalt(II), cadmium(II) and zinc(II). From IR and UV–Vis studies, the phenolic oxygen and imine nitrogen of the ligand were found to be the coordination sites. Thermogravimetric analysis (TGA) data indicate the chelates to be more stable than the corresponding ligands. The melting points increase with shortening of the siloxane segment from azomethine, as well as the result of complexation. The chelates obtained were covalently inserted in polymeric linear structures by polycondensation through the OH‐difunctionalized ligand with 1,3‐bis(carboxypropyl)tetramethyldisiloxane. Direct polycondensation, assisted either by acetic anhydride or N,N′‐dicyclohexylcarbodiimide as dehydrating agent and the complex 4‐(dimethylamino)pyridinium 4‐toluenesulfonate as catalyst, was used for the synthesis of these compound types. The structures of the polymers obtained were confirmed by IR, UV and ¹H NMR. Characterization was undertaken by TGA, solubility tests and viscosity measurements. Copyright © 2003 John Wiley & Sons, Ltd.     

Intraspinal endodermal cyst: ultrastructural study of abnormal cilia.

Abnormal cilia were demonstrated in the lining epithelial cells of three cases of intraspinal endodermal (bronchogenic) cyst. The changes comprised a wide spectrum of ultrastructural abnormalities, including (a). cilia with abnormal axonemal microtubules, (b). swollen cilia, (c). compound cilia with or without excessive ciliary matrix, (d). naked cilia without limiting membrane, and (e). intracytoplasmic cilia and aggregates of microtubules. Of these, compound cilia and swollen cilia were most common. Cilia with dynein arm deficiency were not observed. Ciliary abnormalities found in the present study were very similar to those described in the bronchial epithelium of various diseases. The present findings suggest that the lining epithelium of intraspinal endodermal cyst shares similar ciliogenesis and susceptibility to abnormal ciliary formation as that of the bronchial epithelium.     

Support vector machine via nonlinear rescaling method

In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program 76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated with the given data-set provide important information about each data point and play the key role in selecting the set of support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors in several instances were substantially reduced.